Biased random-to-top shuffling
نویسندگان
چکیده
منابع مشابه
Biased random-to-top shuffling
Recently Wilson [12] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson’s technique to find lower bounds of the correct order for card shuffling Markov chains where at each time step a random card is picked and put at the top of the deck. Two classes of such shuffles are addressed, one where the probability that a given car...
متن کاملCard-cyclic-to-random shuffling with relabeling
The card-cyclic-to-random shuffle is the card shuffle where the n cards are labeled 1, . . . , n according to their starting positions. Then the cards are mixed by first picking card 1 from the deck and reinserting it at a uniformly random position, then repeating for card 2, then for card 3 and so on until all cards have been reinserted in this way. Then the procedure starts over again, by fir...
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملRandom DNA fragmentation with endonuclease V: application to DNA shuffling.
The enzyme endonuclease V nicks uracil-containing DNA at the second or third phosphodiester bond 3' to uracil sites. I applied the enzyme to random fragmentation of DNA to revise the complex DNA shuffling protocol. The merit of using endonuclease V is that cleavage occurs at random sites and the length of the fragments can easily be adjusted by varying the concentration of dUTP in the polymeras...
متن کاملRandom Shuffling to Reduce Disorder in Adaptive Sorting Scheme
Abstract In this paper we present a random shuffling scheme to apply with adaptive sorting algorithms. Adaptive sorting algorithms utilize the presortedness present in a given sequence. We have probabilistically increased the amount of presortedness present in a sequence by using a random shuffling technique that requires little computation. Theoretical analysis suggests that the proposed schem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2006
ISSN: 1050-5164
DOI: 10.1214/10505160600000097